Maximin share and minimax envy in fair-division problems
نویسندگان
چکیده
منابع مشابه
Nuclear Division: Giving Daughters Their Fair Share
How do nuclear components, apart from chromosomes, partition equally to daughter nuclei during mitosis? In Schizosaccharomyces japonicus, the conserved LEM-domain nuclear envelope protein Man1 ensures the formation of identical daughter nuclei by coupling nuclear pore complexes to the segregating chromosomes.
متن کاملBidding for envy-freeness: A procedural approach to n-player fair-division problems
We develop a procedure for implementing an efficient and envy-free allocation of m objects among n individuals with the possibility of monetary side-payments. The procedure eliminates envy by compensating envious players. It is fully descriptive and says explicitly which compensations should be made, and in what order. Moreover, it is simple enough to be carried out without computer support. We...
متن کاملSperner’s Lemma and Fair Division Problems
This paper is a seminar paper that summarizes Fran cis Edward Su’s paper “Rental harmony: Sperner’s lemma in fair division” [1] in 1999. In this paper we introduce and prove Sperner’s Lemma. Then, we introduce the fair division problem and an al gorithm based on Sperner’s lemma that can solve some variants of the fair division problem.
متن کاملFacility Location with Minimax Envy
We study the problem of locating a public facility on a real line or an interval, when agents’ costs are their (expected) distances from the location of the facility. Our goal is to minimize the maximum envy over all agents, which we will refer to as the minimax envy objective, while at the same time ensuring that agents will report their most preferred locations truthfully. First, for the prob...
متن کاملApproximate Maximin Share Allocations in Matroids
The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2003
ISSN: 0022-247X
DOI: 10.1016/s0022-247x(03)00107-0